Keyed row selection

ABSTRACT

Described are methods, systems and computer readable media for keyed row data selection and processing.

This application claims the benefit of U.S. Provisional Application No.62/549,908, entitled “COMPUTER DATA SYSTEM” and filed on Aug. 24, 2017,which is incorporated herein by reference in its entirety.

Embodiments relate generally to computer data systems, and moreparticularly, to methods, systems and computer readable media for keyedrow data selection and processing.

Some graphical user interfaces may provide a display of information froma database query result or other computer data system data object orsource. Data selected on a graphical user interface may occur within adynamically updating display of data (e.g., a query result) that ischanging over time. A need may exist to provide for a selection of datato persist within a dynamically updating data object or data source,even when such selection is no longer visible within the graphical userinterface.

Some implementations were conceived in light of the above mentionedneeds, problems and/or limitations, among other things.

Some implementations can include a computer-implemented method forprocessing keyed row selection of a computer data system data object.The method can include receiving, at a processor, a selection of one ormore keyed rows of the computer data system data object, the selectionbeing received from a graphical user interface that is displaying atleast a portion of data from the computer data system object, andadding, using the processor, one or more key values corresponding to theselection to a selected key values set stored in a computer readablemedium coupled to the processor. The method can also include receiving,at the processor, an indication of an operation that utilizes datacorresponding to the one or more key values, and determining, at theprocessor, whether the data corresponding to the one or more key valuesis stored within a local data store. The method can further include,when the data corresponding to the one or more key values is storedwithin the local data store: retrieving, using the processor, the datacorresponding to the one or more key values from the local data store,and providing, using the processor, data retrieved from the local datastore to an application.

The method can also include determining, at the processor, whether aportion of the data corresponding to the one or more key values is notstored in the local data store and is stored in a remote data store, andwhen a portion of the data corresponding to the one or more key valuesis not stored in the local data store and is stored in the remote datastore: requesting, using the processor, data from the remote data store,and receiving, at the processor, at least a portion of requested datafrom the remote data store. The method can further include providing,using the processor, data received from the remote data store to theapplication.

The method can also include updating the graphical user interface basedon the selection. The method can further include maintaining theselected key values set when the selection is no longer visible withinthe graphical user interface.

Providing data received from the local data store to the application andproviding data received from the remote data store to the applicationcan include storing received data in a temporary working data store. Themethod can also include receiving an update to the computer data systemdata object, wherein the update includes a change to the selection, andperforming an update on the selection based on the update to thecomputer data system data object.

Data returned from the remote data store can include indexes foraccessing data stored on remote data store. The method can furtherinclude receiving, at the processor, an indication that a new row hasbeen added to the computer data system data object, and determining,using the processor, whether the new row is within the selection basedon the selected key values set. The method can also include, if the newrow is part of the selection: updating, using the processor, thegraphical user interface to indicate the new row is within theselection, and providing, from the processor, the new row to theapplication. The method can further include resetting the selected keyvalues set when a new selection is received.

Some implementations can include a system for dynamically updating aremote computer data system data object. The system can include aprocessor coupled to a nontransitory computer readable medium havingstored thereon software instructions that, when executed by theprocessor, cause the processor to perform operations. The operations caninclude receiving, at a processor, a selection of one or more keyed rowsof the computer data system data object, the selection being receivedfrom a graphical user interface that is displaying at least a portion ofdata from the computer data system object. The operations can alsoinclude adding, using the processor, one or more key valuescorresponding to the selection to a selected key values set stored in acomputer readable medium coupled to the processor, and receiving, at theprocessor, an indication of an operation that utilizes datacorresponding to the one or more key values. The operations can furtherinclude determining, at the processor, whether the data corresponding tothe one or more key values is stored within a local data store.

The operations can also include, when the data corresponding to the oneor more key values is stored within the local data store: retrieving,using the processor, the data corresponding to the one or more keyvalues from the local data store, and providing, using the processor,data retrieved from the local data store to an application. Theoperations can further include determining, at the processor, whether aportion of the data corresponding to the one or more key values is notstored in the local data store and is stored in a remote data store.

The operations can also include, when a portion of the datacorresponding to the one or more key values is not stored in the localdata store and is stored in the remote data store: requesting, using theprocessor, data from the remote data store, and receiving, at theprocessor, at least a portion of requested data from the remote datastore. The operations can further include providing, using theprocessor, data received from the remote data store to the application.

The operations can also include updating the graphical user interfacebased on the selection. The operations can further include maintainingthe selected key values set when the selection is no longer visiblewithin the graphical user interface. Providing data received from thelocal data store to the application and providing data received from theremote data store to the application can include storing received datain a temporary working data store.

The operations can also include receiving an update to the computer datasystem data object, wherein the update includes a change to theselection, and performing an update on the selection based on the updateto the computer data system data object. The data returned from theremote data store can include indexes for accessing data stored onremote data store.

The operations can also include receiving, at the processor, anindication that a new row has been added to the computer data systemdata object, and determining, using the processor, whether the new rowis within the selection based on the selected key values set. Theoperations can further include, if the new row is part of the selection:updating, using the processor, the graphical user interface to indicatethe new row is within the selection, and providing, from the processor,the new row to the application. The operations can also includeresetting the selected key values set when a new selection is received.

Some implementations can include a nontransitory computer readablemedium having stored thereon software instructions that, when executedby a processor, cause the processor to perform operations. Theoperations can include receiving, at a processor, a selection of one ormore keyed rows of the computer data system data object, the selectionbeing received from a graphical user interface that is displaying atleast a portion of data from the computer data system object, andadding, using the processor, one or more key values corresponding to theselection to a selected key values set stored in a computer readablemedium coupled to the processor. The operations can also includereceiving, at the processor, an indication of an operation that utilizesdata corresponding to the one or more key values, and determining, atthe processor, whether the data corresponding to the one or more keyvalues is stored within a local data store. The operations can furtherinclude when the data corresponding to the one or more key values isstored within the local data store: retrieving, using the processor, thedata corresponding to the one or more key values from the local datastore, and providing, using the processor, data retrieved from the localdata store to an application. The operations can also includedetermining, at the processor, whether a portion of the datacorresponding to the one or more key values is not stored in the localdata store and is stored in a remote data store.

The operations can further include, when a portion of the datacorresponding to the one or more key values is not stored in the localdata store and is stored in the remote data store: requesting, using theprocessor, data from the remote data store, and receiving, at theprocessor, at least a portion of requested data from the remote datastore. The operations can also include providing, using the processor,data received from the remote data store to the application.

The operations further can include updating the graphical user interfacebased on the selection. The operations can further include maintainingthe selected key values set when the selection is no longer visiblewithin the graphical user interface. Providing data received from thelocal data store to the application and providing data received from theremote data store to the application can include storing received datain a temporary working data store.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an example computer data system showing anexample data distribution configuration in accordance with someimplementations.

FIG. 2 is a diagram of an example computer data system showing anexample administration/process control arrangement in accordance withsome implementations.

FIG. 3 is a diagram of an example computing device configured for GUIcontrol element processing in accordance with some implementations.

FIG. 4 is a flowchart of an example method for keyed row data selectionand processing in accordance with some implementations.

FIG. 5 is a diagram of an example graphical user interface of a computerdata system in accordance with some implementations.

FIG. 6 is a diagram of an example graphical user interface showing aselection of a row of a data object in accordance with someimplementations.

FIG. 7 is a diagram of an example graphical user interface showing aselection of a row of a data object in accordance with someimplementations.

FIG. 8 is a diagram of an example graphical user interface showingselection expansion for a key value of a data object in accordance withsome implementations.

FIG. 9 is a diagram of an example graphical user interface of a computerdata system in which the selected rows are no longer visible inaccordance with some implementations.

FIG. 10 is a diagram showing an example selected data portion existingin a local data store and a remote data store in accordance with someimplementations.

DETAILED DESCRIPTION

Reference may be made herein to the Java programming language, Javaclasses, Java bytecode and the Java Virtual Machine (JVM) for purposesof illustrating example implementations. It will be appreciated thatimplementations can include other programming languages (e.g., groovy,Scala, R, Go, etc.), other programming language structures as analternative to or in addition to Java classes (e.g., other languageclasses, objects, data structures, program units, code portions, scriptportions, etc.), other types of bytecode, object code and/or executablecode, and/or other virtual machines or hardware implemented machinesconfigured to execute a data system query.

FIG. 1 is a diagram of an example computer data system and network 100showing an example data distribution configuration in accordance withsome implementations. In particular, the system 100 includes anapplication host 102, a periodic data import host 104, a query serverhost 106, a long-term file server 108, and a user data import host 110.While tables are used as an example data object in the descriptionbelow, it will be appreciated that the data system described herein canalso process other data objects such as mathematical objects (e.g., asingular value decomposition of values in a given range of one or morerows and columns of a table), TableMap objects, etc. A TableMap objectprovides the ability to lookup a Table by some key. This key representsa unique value (or unique tuple of values) from the columns aggregatedon in a byExternal( ) statement execution, for example. A TableMapobject can be the result of a byExternal( ) statement executed as partof a query. It will also be appreciated that the configurations shown inFIGS. 1 and 2 are for illustration purposes and in a givenimplementation each data pool (or data store) may be directly attachedor may be managed by a file server.

The application host 102 can include one or more application processes112, one or more log files 114 (e.g., sequential, row-oriented logfiles), one or more data log tailers 116 and a multicast key-valuepublisher 118. The periodic data import host 104 can include a localtable data server, direct or remote connection to a periodic table datastore 122 (e.g., a column-oriented table data store) and a data importserver 120. The query server host 106 can include a multicast key-valuesubscriber 126, a performance table logger 128, local table data store130 and one or more remote query processors (132, 134) each accessingone or more respective tables (136, 138). The long-term file server 108can include a long-term data store 140. The user data import host 110can include a remote user table server 142 and a user table data store144. Row-oriented log files and column-oriented table data stores arediscussed herein for illustration purposes and are not intended to belimiting. It will be appreciated that log files and/or data stores maybe configured in other ways. In general, any data stores discussedherein could be configured in a manner suitable for a contemplatedimplementation.

In operation, the input data application process 112 can be configuredto receive input data from a source (e.g., a securities trading datasource), apply schema-specified, generated code to format the loggeddata as it's being prepared for output to the log file 114 and store thereceived data in the sequential, row-oriented log file 114 via anoptional data logging process. In some implementations, the data loggingprocess can include a daemon, or background process task, that isconfigured to log raw input data received from the application process112 to the sequential, row-oriented log files on disk and/or a sharedmemory queue (e.g., for sending data to the multicast publisher 118).Logging raw input data to log files can additionally serve to provide abackup copy of data that can be used in the event that downstreamprocessing of the input data is halted or interrupted or otherwisebecomes unreliable.

A data log tailer 116 can be configured to access the sequential,row-oriented log file(s) 114 to retrieve input data logged by the datalogging process. In some implementations, the data log tailer 116 can beconfigured to perform strict byte reading and transmission (e.g., to thedata import server 120). The data import server 120 can be configured tostore the input data into one or more corresponding data stores such asthe periodic table data store 122 in a column-oriented configuration.The periodic table data store 122 can be used to store data that isbeing received within a time period (e.g., a minute, an hour, a day,etc.) and which may be later processed and stored in a data store of thelong-term file server 108. For example, the periodic table data store122 can include a plurality of data servers configured to store periodicsecurities trading data according to one or more characteristics of thedata (e.g., a data value such as security symbol, the data source suchas a given trading exchange, etc.).

The data import server 120 can be configured to receive and store datainto the periodic table data store 122 in such a way as to provide aconsistent data presentation to other parts of the system.Providing/ensuring consistent data in this context can include, forexample, recording logged data to a disk or memory, ensuring rowspresented externally are available for consistent reading (e.g., to helpensure that if the system has part of a record, the system has all ofthe record without any errors), and preserving the order of records froma given data source. If data is presented to clients, such as a remotequery processor (132, 134), then the data may be persisted in somefashion (e.g., written to disk).

The local table data server 124 can be configured to retrieve datastored in the periodic table data store 122 and provide the retrieveddata to one or more remote query processors (132, 134) via an optionalproxy.

The remote user table server (RUTS) 142 can include a centralizedconsistent data writer, as well as a data server that providesprocessors with consistent access to the data that it is responsible formanaging. For example, users can provide input to the system by writingtable data that is then consumed by query processors.

The remote query processors (132, 134) can use data from the data importserver 120, local table data server 124 and/or from the long-term fileserver 108 to perform queries. The remote query processors (132, 134)can also receive data from the multicast key-value subscriber 126, whichreceives data from the multicast key-value publisher 118 in theapplication host 102. The performance table logger 128 can logperformance information about each remote query processor and itsrespective queries into a local table data store 130. Further, theremote query processors can also read data from the RUTS, from localtable data written by the performance logger, or from user table dataread over NFS, for example.

It will be appreciated that the configuration shown in FIG. 1 is atypical example configuration that may be somewhat idealized forillustration purposes. An actual configuration may include one or moreof each server and/or host type. The hosts/servers shown in FIG. 1(e.g., 102-110, 120, 124 and 142) may each be separate or two or moreservers may be combined into one or more combined server systems. Datastores can include local/remote, shared/isolated and/or redundant. Anytable data may flow through optional proxies indicated by an asterisk oncertain connections to the remote query processors. Also, it will beappreciated that the term “periodic” is being used for illustrationpurposes and can include, but is not limited to, data that has beenreceived within a given time period (e.g., millisecond, second, minute,hour, day, week, month, year, etc.) and which has not yet been stored toa long-term data store (e.g., 140).

FIG. 2 is a diagram of an example computer data system 200 showing anexample administration/process control arrangement in accordance withsome implementations. The system 200 includes a production client host202, a controller host 204, a GUI host or workstation 206, and queryserver hosts 208 and 210. It will be appreciated that there may be oneor more of each of 202-210 in a given implementation.

The production client host 202 can include a batch query application 212(e.g., a query that is executed from a command line interface or thelike) and a real time query data consumer process 214 (e.g., anapplication that connects to and listens to tables created from theexecution of a separate query). The batch query application 212 and thereal time query data consumer 214 can connect to a remote querydispatcher 222 and one or more remote query processors (224, 226) withinthe query server host 1 208.

The controller host 204 can include a persistent query controller 216configured to connect to a remote query dispatcher 232 and one or moreremote query processors 228-230. In some implementations, the persistentquery controller 216 can serve as the “primary client” for persistentqueries and can request remote query processors from dispatchers, andsend instructions to start persistent queries. For example, a user cansubmit a query to 216, and 216 starts and runs the query every day. Inanother example, a securities trading strategy could be a persistentquery. The persistent query controller can start the trading strategyquery every morning before the market opened, for instance. It will beappreciated that 216 can work on times other than days. In someimplementations, the controller may require its own clients to requestthat queries be started, stopped, etc. This can be done manually, or byscheduled (e.g., cron) jobs. Some implementations can include “advancedscheduling” (e.g., auto-start/stop/restart, time-based repeat, etc.)within the controller.

The GUI/host workstation can include a user console 218 and a user queryapplication 220. The user console 218 can be configured to connect tothe persistent query controller 216. The user query application 220 canbe configured to connect to one or more remote query dispatchers (e.g.,232) and one or more remote query processors (228, 230).

FIG. 3 is a diagram of an example computing device 300 in accordancewith at least one implementation. The computing device 300 includes oneor more processors 302, operating system 304, computer readable medium306 and network interface 308. The memory 306 can include a keyed rowselection application 310 and a data section 312 (e.g., for storingin-memory tables, etc.).

In operation, the processor 302 may execute the application 310 storedin the memory 306. The application 310 can include software instructionsthat, when executed by the processor, cause the processor to performoperations for dynamic updating of query result displays in accordancewith the present disclosure (e.g., performing one or more of 402-420described below).

The application program 310 can operate in conjunction with the datasection 312 and the operating system 304.

As used herein, a data source can include, but is not limited to, a realtime or near real time data source such as securities market data (e.g.,over a multicast distribution mechanism (e.g., 118/126) or through atailer (e.g., 116), system generated data, historical data, user inputdata from a remote user table server, tables programmatically generatedin-memory, or an element upstream in an update propagation graph (UPG)such as a directed acyclic graph (DAG), and/or any data (e.g., a table,mathematical object, etc.) having a capability to refresh itself/provideupdated data.

When a data source is updated, it will send add, delete, modify, reindex(AMDR) notifications through the DAG. It will be appreciated that a DAGis used herein for illustration purposes of a possible implementation ofthe UPG, and that the UPG can include other implementations. A reindexmessage is a message to change the indexing of a data item, but notchange the value. When a table is exported from the server to a client,there is an exported table handle created and that handle attachesitself to the DAG; as a child of the table to be displayed. When the DAGupdates, that handle's node in the DAG is reached and a notification issent across the network to the client that includes the rows which havebeen added/modified/deleted/reindexed. On the client side, those rowsare reconstructed and an in-memory copy of the table (or portionthereof) is maintained for display (or other access).

There can be two cases in which a view is updated. In the first case, asystem clock ticks, and there is new data for one or more source(parent) nodes in the DAG, which percolates down to the exported tablehandle. In the second case, a user changes the “viewport”, which is theactive set of rows and columns.

There can be various ways the viewport is caused to be updated, such as:(i) scrolling the view of the table, (ii) showing or hiding a table,(iii) when the user or client program programmatically accesses thetable, and/or (iv) adding/removing columns from a view. When theviewport is updated, the viewport is automatically adjusted to includethe rows/columns that the user is trying to access with exponentialexpansion up to a limit for efficiency. After a timeout, anyautomatically created viewports are closed.

A query result may not change without a clock tick that has one or moreAMDR messages which traverse the DAG. However, the portion of a queryresult that is displayed by the user (e.g., the viewport) might change.When a user displays a table, a set of visible columns and rows iscomputed. In addition to the visible set of rows/columns, the system maycompute (and make available for possible display) more data than isvisible. For example, the system may compute and make available forpossible display three screens of data: the currently visible screen andone screen before and one screen after. If there are multiple views ofthe same table, either multiple exported table handles are created inwhich case the views are independent or if a single exported tablehandle is created, the viewport is the union of the visible sets. As theuser scrolls the table, the viewport may change. When the viewportchanges, the visible area (with a buffer of rows up and down, andcolumns left and right, so that scrolling is smooth) is computed and theupdated visible area is sent to the server. In response, the serversends a snapshot with relevant portions of those newly visiblerows/columns. For non-displayed tables, the visible area can beconsidered the whole table by the system for further processing so thata consistent table view is available for further processing (e.g., allrows and one or more columns of the data object may be sent to theclient).

The snapshot can be generated asynchronously from the DAG update/tablerefresh loop under the condition that a consistent snapshot (i.e., theclock value remains the same throughout the snapshot) is able to beobtained. If a consistent snapshot is not obtained after a given numberof attempts (e.g., three attempts), a lock can be obtained (e.g., theLiveTableMonitor lock) at the end of the current DAG update cycle tolock out updates while the snapshot is created.

Further, the remote query processor (or server) has knowledge of thevisible regions and will send data updates for the visible rows/columns(e.g., it can send the entire AMDR message information so the client hasinformation about what has been updated, just not what the actual datais outside of its viewport). This enables the client optionally to cachedata even if the data is outside the viewport and only invalidate thedata once the data actually changes.

The DAG structure can be maintained in the memory of a remote queryprocessor. Child nodes have hard references back to their parents, andparents have weak references to their children. This ensures that if achild exists, its parent will also exist, but if there are no externalreferences to a child, then a garbage collection event can properlyclean the child up (and the parent won't hold onto the child). For theexported table handles, a component (e.g., an ExportedTableHandleManagercomponent) can be configured to hold hard references to the exportedtables. If a client disconnects, then the references for its tables canbe cleaned up. Clients can also proactively release references.

FIG. 4 is a flowchart of an example method 400 for keyed row dataselection and processing in accordance with some implementations.Processing begins at 402, where a selection of one or more rows within acomputer data system data object or data source is received. Theselection can be received from a graphical user interface (GUI)displaying a portion of the data object or data source and can be basedon one or more rows selected by a user in the GUI (e.g., via mouse clickand/or drag of a row or a field within a row, combination of keyboardcommand and mouse action, touch screen input, voice input, keyboardinput, etc.). A user can select multiple rows using input commands suchas mouse input in combination with keyboard input (e.g., mouse clickingwhile pressing a CTRL or Shift key on a key board, etc.).

The selected row(s) can include a key field. The key can be unique ornon-unique. For example, if the data object is keyed on a given field,the selection of a row can cause the system to automatically select theother rows in the data object having a key field that matches the keyfield value of the one or more rows that were selected by the user.Matching can include an exact match of a key field value or matchingwhen a key field value is within a given threshold number of a key fieldvalue of a selected row. Processing continues to 404.

At 404, one or more key values corresponding to the one or more selectedare added to a selected key values set. For example, a key value is readfrom a row that was selected by a user and the key value from theselected row (or rows) is added to the selected key values set.Processing continues to 406.

At 406, the GUI is refreshed (or repainted) to show the selected row(s).The repainting of the GUI to reflect the selection can be performed“lazily”, according to the GUI refresh rate, or when processing permits.Processing continues to 407.

At 407, an indication of an operation that utilizes data from rowscorresponding to the selected key values set is received. For example,an indication of a copy operation can be received (e.g., when a userperforms a copy operation via keystroke such as control-C or via mouseoperation or menu selection). The copy operation references the selectedrow(s). Other operations could utilize the selected rows. Processingcontinues to 408.

At 408, once the indication of an operation that utilizes the selectedrow(s), the system can determine whether the data is present in a localdata store (e.g., within the local memory of a client device or system).Programmatically determining whether data from the selected row(s) ispresent locally can be accomplished by comparing indexes of rowscorresponding to the selected key value set to the indexes of rowsstored in the local data store. It will be appreciated that the therecan be at least three ranges of rows (or other data aspects) associatedwith a data object: a range of data visible within the GUI, a range ofdata stored in a local data store and a range of data stored in a remotedata store. Processing continues to 410.

At 410, it is determined whether data corresponding to the selectedrow(s) is available locally. If the data, or a portion of the data, isavailable locally, processing continues to 412. If there is no locallyavailable data corresponding to the selection, processing continues to416. In some implementations, the system may choose to ignore local dataif there is a possibility that some data may not be local. By ignoringlocal data, the system can help ensure that a consistent snapshot ofdata is created on the remote data store rather than producingpotentially inconsistent results (e.g., with some data from a localstore and some from a remote store) in the face of concurrent updateoperations.

At 412, the local data and/or indexes to the local data are copied to alocal temporary working data store (e.g., clipboard memory, scratchpadstorage, etc.). Processing continues to 414.

At 414, if the system determines that additional data is needed beyondthe data locally available (e.g., when a portion of the datacorresponding to the selected row(s) is available from the local datastore and a portion is not available in the local data store),processing continues to 416.

At 416, a requesting system (e.g., a remote query processor, a clientsystem, etc.) sends a request to a remote data server (e.g., 104 or 108)for data from a remote data store corresponding to the selected keyvalue set. For example, the system could send a request for data from aremote data store in which a given key field has a value matching one ofthe values in the selected key value set. Processing continues to 418.

At 418, the requesting system receives data rows or indexes to therequested data in the remote data store. The remote data server mayprovide a copy of the data if the size of the data being provided isless than a threshold size. If the size of the data being provided isgreater than the threshold data size, then the remote data server mayprovide a set of indexes into one or more remote data objects so thatthe requesting system can retrieve the data as memory space, time, etc.permit. By providing the indexes of the remote data, the system canimprove the performance of a distributed computer data system in which aclient system may not have sufficient memory, processing, network orother resources to accommodate the amount of data represented by theselection or the selected key value set. Processing continues to 420.

At 420, the data and/or indexes corresponding to the selected key valueset is stored in a selected data storage such as a temporary workingmemory area (e.g., clipboard, memory scratchpad, etc.) for subsequentuse. For example, a user may select one or more rows, then provide acopy command (e.g., via control-C or the like). In response, the systemmay copy the selected data into the clipboard of the user's system(e.g., a client system).

FIG. 5 is a diagram of an example graphical user interface 500 (GUI) ofa computer data system in accordance with some implementations. The GUI500 includes data source local data 502, a GUI viewport 504, a portionof data visible within the GUI viewport 506, and a portion of data notvisible within the GUI viewport 508.

FIG. 6 is a diagram of GUI 500 showing a selection of a row of a dataobject 602. The selected row has a key value of A as shown in the datafield 1 column, which is the key field in this example, which is simplefor illustration purposes. A key need not be limited to a single value.In some implementations, a key can include a composite of several valuesto more specifically define rows.

FIG. 7 is a diagram of GUI 500 a selection of a row 702 of the dataobject. As shown in FIG. 7, the row has been displayed as selected(e.g., has different background formatting or other display attributesfrom the unselected rows within the viewport).

FIG. 8 is a diagram of the GUI 500 showing selection expansion for a keyvalue of a data object. In particular, the selection has beenautomatically expanded from the row the user selected to include otherrows having a key value of A (802 and 804). The key value can be readfrom the selected row(s) and added to the selected key value set. FIG. 9is a diagram of the GUI 500 in which the selected rows (802 and 804) areno longer visible within the GUI view port 504. For example, the dataobject (e.g., a table) may be updating dynamically and new rows havebeen added and caused the selected rows to move outside of the viewport504. The selected data persists as selected via the selected value seteven though selected rows may no longer be visible within the viewport504. In some implementations, the GUI may maintain selected data asvisible within a viewport by recomputing location and recentering theviewport to show some or all of the selected data.

In some implementations, a selected row may be removed from a dataobject and the key value for the removed row may be maintained in theselected key value set until the selected key value set is cleared(e.g., by receiving a new selection, which clears the previousselection). In some implementations, when a selected row changes, thechange may not alter the selection (e.g., the selected key value set).

FIG. 10 is a diagram showing an example of selected key values 1004corresponding to selected local data 1012 within a local data store 1008and selected remote data 1010 within a remote data store 1006.

It will be appreciated that the modules, processes, systems, andsections described above can be implemented in hardware, hardwareprogrammed by software, software instructions stored on a nontransitorycomputer readable medium or a combination of the above. A system asdescribed above, for example, can include a processor configured toexecute a sequence of programmed instructions stored on a nontransitorycomputer readable medium. For example, the processor can include, butnot be limited to, a personal computer or workstation or other suchcomputing system that includes a processor, microprocessor,microcontroller device, or is comprised of control logic includingintegrated circuits such as, for example, an Application SpecificIntegrated Circuit (ASIC), a field programmable gate array (FPGA),GPGPU, GPU, or the like. The instructions can be compiled from sourcecode instructions provided in accordance with a programming languagesuch as Java, C, C++, C #.net, assembly or the like. The instructionscan also comprise code and data objects provided in accordance with, forexample, the Visual Basic™ language, a specialized database querylanguage, or another structured or object-oriented programming language.The sequence of programmed instructions, or programmable logic deviceconfiguration software, and data associated therewith can be stored in anontransitory computer-readable medium such as a computer memory orstorage device which may be any suitable memory apparatus, such as, butnot limited to ROM, PROM, EEPROM, RAM, flash memory, disk drive and thelike.

Furthermore, the modules, processes systems, and sections can beimplemented as a single processor or as a distributed processor.Further, it should be appreciated that the steps mentioned above may beperformed on a single or distributed processor (single and/ormulti-core, or cloud computing system). Also, the processes, systemcomponents, modules, and sub-modules described in the various figures ofand for embodiments above may be distributed across multiple computersor systems or may be co-located in a single processor or system. Examplestructural embodiment alternatives suitable for implementing themodules, sections, systems, means, or processes described herein areprovided below.

The modules, processors or systems described above can be implemented asa programmed general purpose computer, an electronic device programmedwith microcode, a hard-wired analog logic circuit, software stored on acomputer-readable medium or signal, an optical computing device, anetworked system of electronic and/or optical devices, a special purposecomputing device, an integrated circuit device, a semiconductor chip,and/or a software module or object stored on a computer-readable mediumor signal, for example.

Embodiments of the method and system (or their sub-components ormodules), may be implemented on a general-purpose computer, aspecial-purpose computer, a programmed microprocessor or microcontrollerand peripheral integrated circuit element, an ASIC or other integratedcircuit, a digital signal processor, a hardwired electronic or logiccircuit such as a discrete element circuit, a programmed logic circuitsuch as a PLD, PLA, FPGA, PAL, or the like. In general, any processorcapable of implementing the functions or steps described herein can beused to implement embodiments of the method, system, or a computerprogram product (software program stored on a nontransitory computerreadable medium).

Furthermore, embodiments of the disclosed method, system, and computerprogram product (or software instructions stored on a nontransitorycomputer readable medium) may be readily implemented, fully orpartially, in software using, for example, object or object-orientedsoftware development environments that provide portable source code thatcan be used on a variety of computer platforms. Alternatively,embodiments of the disclosed method, system, and computer programproduct can be implemented partially or fully in hardware using, forexample, standard logic circuits or a VLSI design. Other hardware orsoftware can be used to implement embodiments depending on the speedand/or efficiency requirements of the systems, the particular function,and/or particular software or hardware system, microprocessor, ormicrocomputer being utilized. Embodiments of the method, system, andcomputer program product can be implemented in hardware and/or softwareusing any known or later developed systems or structures, devices and/orsoftware by those of ordinary skill in the applicable art from thefunction description provided herein and with a general basic knowledgeof the software engineering and computer networking arts.

Moreover, embodiments of the disclosed method, system, and computerreadable media (or computer program product) can be implemented insoftware executed on a programmed general purpose computer, a specialpurpose computer, a microprocessor, or the like.

It is, therefore, apparent that there is provided, in accordance withthe various embodiments disclosed herein, methods, systems and computerreadable media for keyed row selection and data processing operationsusing selected data.

Application Ser. No. 15/154,974, entitled “DATA PARTITIONING ANDORDERING” and filed in the United States Patent and Trademark Office onMay 14, 2016, is hereby incorporated by reference herein in its entiretyas if fully set forth herein.

Application Ser. No. 15/154,975, entitled “COMPUTER DATA SYSTEM DATASOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH” and filed in theUnited States Patent and Trademark Office on May 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/154,979, entitled “COMPUTER DATA SYSTEMPOSITION-INDEX MAPPING” and filed in the United States Patent andTrademark Office on May 14, 2016, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,980, entitled “SYSTEM PERFORMANCE LOGGING OFCOMPLEX REMOTE QUERY PROCESSOR QUERY OPERATIONS” and filed in the UnitedStates Patent and Trademark Office on May 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/154,983, entitled “DISTRIBUTED AND OPTIMIZEDGARBAGE COLLECTION OF REMOTE AND EXPORTED TABLE HANDLE LINKS TO UPDATEPROPAGATION GRAPH NODES” and filed in the United States Patent andTrademark Office on May 14, 2016, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,984, entitled “COMPUTER DATA SYSTEM CURRENTROW POSITION QUERY LANGUAGE CONSTRUCT AND ARRAY PROCESSING QUERYLANGUAGE CONSTRUCTS” and filed in the United States Patent and TrademarkOffice on May 14, 2016, is hereby incorporated by reference herein inits entirety as if fully set forth herein.

Application Ser. No. 15/154,985, entitled “PARSING AND COMPILING DATASYSTEM QUERIES” and filed in the United States Patent and TrademarkOffice on May 14, 2016, is hereby incorporated by reference herein inits entirety as if fully set forth herein.

Application Ser. No. 15/154,987, entitled “DYNAMIC FILTER PROCESSING”and filed in the United States Patent and Trademark Office on May 14,2016, is hereby incorporated by reference herein in its entirety as iffully set forth herein.

Application Ser. No. 15/154,988, entitled “DYNAMIC JOIN PROCESSING USINGREAL-TIME MERGED NOTIFICATION LISTENER” and filed in the United StatesPatent and Trademark Office on May 14, 2016, is hereby incorporated byreference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,990, entitled “DYNAMIC TABLE INDEX MAPPING”and filed in the United States Patent and Trademark Office on May 14,2016, is hereby incorporated by reference herein in its entirety as iffully set forth herein.

Application Ser. No. 15/154,991, entitled “QUERY TASK PROCESSING BASEDON MEMORY ALLOCATION AND PERFORMANCE CRITERIA” and filed in the UnitedStates Patent and Trademark Office on May 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/154,993, entitled “A MEMORY-EFFICIENT COMPUTERSYSTEM FOR DYNAMIC UPDATING OF JOIN PROCESSING” and filed in the UnitedStates Patent and Trademark Office on May 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/154,995, entitled “QUERY DISPATCH AND EXECUTIONARCHITECTURE” and filed in the United States Patent and Trademark Officeon May 14, 2016, is hereby incorporated by reference herein in itsentirety as if fully set forth herein.

Application Ser. No. 15/154,996, entitled “COMPUTER DATA DISTRIBUTIONARCHITECTURE” and filed in the United States Patent and Trademark Officeon May 14, 2016, is hereby incorporated by reference herein in itsentirety as if fully set forth herein.

Application Ser. No. 15/154,997, entitled “DYNAMIC UPDATING OF QUERYRESULT DISPLAYS” and filed in the United States Patent and TrademarkOffice on May 14, 2016, is hereby incorporated by reference herein inits entirety as if fully set forth herein.

Application Ser. No. 15/154,998, entitled “DYNAMIC CODE LOADING” andfiled in the United States Patent and Trademark Office on May 14, 2016,is hereby incorporated by reference herein in its entirety as if fullyset forth herein.

Application Ser. No. 15/154,999, entitled “IMPORTATION, PRESENTATION,AND PERSISTENT STORAGE OF DATA” and filed in the United States Patentand Trademark Office on May 14, 2016, is hereby incorporated byreference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,001, entitled “COMPUTER DATA DISTRIBUTIONARCHITECTURE” and filed in the United States Patent and Trademark Officeon May 14, 2016, is hereby incorporated by reference herein in itsentirety as if fully set forth herein.

Application Ser. No. 15/155,005, entitled “PERSISTENT QUERY DISPATCH ANDEXECUTION ARCHITECTURE” and filed in the United States Patent andTrademark Office on May 14, 2016, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,006, entitled “SINGLE INPUT GRAPHICAL USERINTERFACE CONTROL ELEMENT AND METHOD” and filed in the United StatesPatent and Trademark Office on May 14, 2016, is hereby incorporated byreference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,007, entitled “GRAPHICAL USER INTERFACEDISPLAY EFFECTS FOR A COMPUTER DISPLAY SCREEN” and filed in the UnitedStates Patent and Trademark Office on May 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/155,009, entitled “COMPUTER ASSISTED COMPLETIONOF HYPERLINK COMMAND SEGMENTS” and filed in the United States Patent andTrademark Office on May 14, 2016, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,010, entitled “HISTORICAL DATA REPLAYUTILIZING A COMPUTER SYSTEM” and filed in the United States Patent andTrademark Office on May 14, 2016, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,011, entitled “DATA STORE ACCESS PERMISSIONSYSTEM WITH INTERLEAVED APPLICATION OF DEFERRED ACCESS CONTROL FILTERS”and filed in the United States Patent and Trademark Office on May 14,2016, is hereby incorporated by reference herein in its entirety as iffully set forth herein.

Application Ser. No. 15/155,012, entitled “REMOTE DATA OBJECTPUBLISHING/SUBSCRIBING SYSTEM HAVING A MULTICAST KEY-VALUE PROTOCOL” andfiled in the United States Patent and Trademark Office on May 14, 2016,is hereby incorporated by reference herein in its entirety as if fullyset forth herein.

Application Ser. No. 15/351,429, entitled “QUERY TASK PROCESSING BASEDON MEMORY ALLOCATION AND PERFORMANCE CRITERIA” and filed in the UnitedStates Patent and Trademark Office on Nov. 14, 2016, is herebyincorporated by reference herein in its entirety as if fully set forthherein.

Application Ser. No. 15/813,112, entitled “COMPUTER DATA SYSTEM DATASOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH HAVING A MERGED JOINLISTENER” and filed in the United States Patent and Trademark Office onNov. 14, 2017, is hereby incorporated by reference herein in itsentirety as if fully set forth herein.

Application Ser. No. 15/813,142, entitled “COMPUTER DATA SYSTEM DATASOURCE HAVING AN UPDATE PROPAGATION GRAPH WITH FEEDBACK CYCLICALITY” andfiled in the United States Patent and Trademark Office on Nov. 14, 2017,is hereby incorporated by reference herein in its entirety as if fullyset forth herein.

Application Ser. No. 15/813,127, entitled “COMPUTER DATA DISTRIBUTIONARCHITECTURE CONNECTING AN UPDATE PROPAGATION GRAPH THROUGH MULTIPLEREMOTE QUERY PROCESSORS” and filed in the United States Patent andTrademark Office on Nov. 14, 2017, is hereby incorporated by referenceherein in its entirety as if fully set forth herein.

While the disclosed subject matter has been described in conjunctionwith a number of embodiments, it is evident that many alternatives,modifications and variations would be, or are, apparent to those ofordinary skill in the applicable arts. Accordingly, Applicants intend toembrace all such alternatives, modifications, equivalents and variationsthat are within the spirit and scope of the disclosed subject matter.

What is claimed is:
 1. A computer-implemented method for processingkeyed row selection of a computer data system data object, the methodcomprising: receiving, at a processor, a selection of one or more keyedrows of the computer data system data object, the selection beingreceived from a graphical user interface that is displaying at least aportion of data from the computer data system data object; in responseto receiving the selection, when the computer data system data object iskeyed on a given key field, automatically selecting other rows in thecomputer data system data object having a key field that is within apredetermined threshold value of the given key field of the one or morekeyed rows in the received selection; adding, using the processor, oneor more key values corresponding to the selection to a selected keyvalues set stored in a computer readable medium coupled to theprocessor, wherein the one or more key values are one or more of asingle value or a composite of several values that specifically definethe one or more keyed rows; receiving, at the processor, an indicationof an operation that utilizes data corresponding to the one or more keyvalues; determining, at the processor, whether the data corresponding tothe one or more key values is stored within a local data store; when thedata corresponding to the one or more key values is stored within thelocal data store: retrieving, using the processor, the datacorresponding to the one or more key values from the local data store;providing, using the processor, data retrieved from the local data storeto an application; determining, at the processor, whether a portion ofthe data corresponding to the one or more key values is not stored inthe local data store and is stored in a remote data store; when aportion of the data corresponding to the one or more key values is notstored in the local data store and is stored in the remote data store:requesting, using the processor, data from the remote data store;receiving, at the processor, at least a portion of requested data fromthe remote data store; and providing, using the processor, data receivedfrom the remote data store to the application; and persisting selectedkey values as selected based on the selection within the graphical userinterface when the selection is no longer visible within a viewable areaof the graphical user interface.
 2. The computer-implemented method ofclaim 1, further comprising updating the graphical user interface basedon the selection.
 3. The computer-implemented method of claim 1, whereinproviding data received from the local data store to the application andproviding data received from the remote data store to the applicationinclude storing received data in a temporary working data store.
 4. Thecomputer-implemented method of claim 1, further comprising: receiving anupdate to the computer data system data object, wherein the updateincludes a change to the selection; and performing an update on theselection based on the update to the computer data system data object.5. The computer-implemented method of claim 1, wherein the data returnedfrom the remote data store includes indexes for accessing data stored onthe remote data store.
 6. The computer-implemented method of claim 1,further comprising: receiving, at the processor, an indication that anew row has been added to the computer data system data object;determining, using the processor, whether the new row is within theselection based on the selected key values set; and if the new row ispart of the selection: updating, using the processor, the graphical userinterface to indicate the new row is within the selection; andproviding, from the processor, the new row to the application.
 7. Thecomputer-implemented method of claim 1, further comprising resetting theselected key values set when a new selection is received.
 8. A systemfor dynamically updating a remote computer data system data object, thesystem comprising: a processor coupled to a nontransitory computerreadable medium having stored thereon software instructions that, whenexecuted by the processor, cause the processor to perform operationsincluding: receiving, at the processor, a selection of one or more keyedrows of the computer data system data object, the selection beingreceived from a graphical user interface that is displaying at least aportion of data from the computer data system data object; in responseto receiving the selection, when the computer data system data object iskeyed on a given key field, automatically selecting other rows in thecomputer data system data object having a key field that is within apredetermined threshold value of the given key field of the one or morekeyed rows in the received selection; adding, using the processor, oneor more key values corresponding to the selection to a selected keyvalues set stored in a computer readable medium coupled to theprocessor, wherein the one or more key values are one or more of asingle value or a composite of several values that specifically definethe one or more keyed rows, receiving, at the processor, an indicationof an operation that utilizes data corresponding to the one or more keyvalues; determining, at the processor, whether the data corresponding tothe one or more key values is stored within a local data store; when thedata corresponding to the one or more key values is stored within thelocal data store: retrieving, using the processor, the datacorresponding to the one or more key values from the local data store;providing, using the processor, data retrieved from the local data storeto an application; determining, at the processor, whether a portion ofthe data corresponding to the one or more key values is not stored inthe local data store and is stored in a remote data store; when aportion of the data corresponding to the one or more key values is notstored in the local data store and is stored in the remote data store:requesting, using the processor, data from the remote data store;receiving, at the processor, at least a portion of requested data fromthe remote data store; and providing, using the processor, data receivedfrom the remote data store to the application; and persisting selectedkey values as selected based on the selection within the graphical userinterface when the selection is no longer visible within a viewable areaof the graphical user interface.
 9. The system of claim 8, wherein theoperations further include updating the graphical user interface basedon the selection.
 10. The system of claim 8, wherein providing datareceived from the local data store to the application and providing datareceived from the remote data store to the application include storingreceived data in a temporary working data store.
 11. The system of claim8, wherein the operations further include: receiving an update to thecomputer data system data object, wherein the update includes a changeto the selection; and performing an update on the selection based on theupdate to the computer data system data object.
 12. The system of claim8, wherein the data returned from the remote data store includes indexesfor accessing data stored on the remote data store.
 13. The system ofclaim 8, the operations further comprising: receiving, at the processor,an indication that a new row has been added to the computer data systemdata object; determining, using the processor, whether the new row iswithin the selection based on the selected key values set; and if thenew row is part of the selection: updating, using the processor, thegraphical user interface to indicate the new row is within theselection; and providing, from the processor, the new row to theapplication.
 14. The system of claim 8, further comprising resetting theselected key values set when a new selection is received.
 15. Acomputer-implemented method for processing keyed row selection of acomputer data system data object, the method comprising: receiving, at aprocessor, a selection of one or more keyed rows of the computer datasystem data object, the selection being received from a graphical userinterface that is displaying at least a portion of data from thecomputer data system data object; in response to receiving theselection, when the computer data system data object is keyed on a givenkey field, automatically selecting other rows in the computer datasystem data object having a key field that is within a predeterminedthreshold value of the given key field of the one or more keyed rows inthe received selection; adding, using the processor, one or more keyvalues corresponding to the selection to a selected key values setstored in a computer readable medium coupled to the processor;receiving, at the processor, an indication of an operation that utilizesdata corresponding to the one or more key values, wherein at least partof the data corresponding to the one or more key values is not displayedwithin the graphical user interface; determining, at the processor,whether all the data corresponding to the one or more key values isstored within a local data store; when all the data corresponding to theone or more key values is stored within the local data store:retrieving, using the processor, the data corresponding to the one ormore key values from the local data store; providing, using theprocessor, data retrieved from the local data store to an application;when all the data corresponding to the one or more key values is notstored within the local data store: requesting, using the processor, thedata corresponding to the one or more key values from a remote datastore; receiving, at the processor, the requested data from the remotedata store; retrieving, using the processor, the data corresponding tothe one or more key values from the remote data store; and providing,using the processor, data received from the remote data store to theapplication; and persisting selected key values as selected based on theselection within the graphical user interface when the selection is nolonger visible within a viewable area of the graphical user interface.16. The computer-implemented method of claim 15, further comprisingupdating the graphical user interface based on the selection.
 17. Thecomputer-implemented method of claim 16, wherein the graphical userinterface is updated in one of: according to a graphical user interfacerefresh rate or when processing allows for the update.
 18. Thecomputer-implemented method of claim 15, further comprising: receivingan update to the computer data system data object, wherein the updateincludes a change to the selection; and performing an update on theselection based on the update to the computer data system data object.19. The computer-implemented method of claim 15, wherein the one or morekey values is a composite of several values that specifically correspondto the one or more keyed rows.
 20. The computer-implemented method ofclaim 15, wherein one or more changes to data corresponding to theselection does not change the one or more key values until the selectedkey values set is cleared.